Combining Mahalanobis and Jaccard Distance to Overcome Similarity Measurement Constriction on Geometrical Shapes
نویسندگان
چکیده
In this study Jaccard Distance was performed by measuring the asymmetric information on binary variable and the comparison between vectors component. It compared two objects and notified the degree of similarity of these objects. After thorough preprocessing tasks; like translation, rotation, invariance scale content and noise resistance done onto the hand sketch object, Jaccard distance still did not show significance improvement. Hence this paper combined Mahalanobis measure with Jaccard distance to improve the similarity performances. It started with the same pre-processing tasks and feature analysis, shape normalization, shape perfection and followed with binary data conversion. Then each edge of the geometric shape was separated and measured using Jaccard distance. The shapes that passed the threshold value were measured by Mahalanobis distance. The results showed that the similarity percentage had increased from 61% to 84%, thus accrued an improved average of 21.6% difference.
منابع مشابه
Assessing the Use of Similarity Distance Measurement in Shape Recognition
Distance measure is one of the techniques widely used to measure the similarity between two feature matrices of objects. The objective of this paper is to explore researches on applied distance measures in shape-based recognition. In distance measures computation, patterns that are similar will have a small distance while uncorrelated pattern in the feature space will have a far a part distance...
متن کاملMetric Learning for Synonym Acquisition
The distance or similarity metric plays an important role in many natural language processing (NLP) tasks. Previous studies have demonstrated the effectiveness of a number of metrics such as the Jaccard coefficient, especially in synonym acquisition. While the existing metrics perform quite well, to further improve performance, we propose the use of a supervised machine learning algorithm that ...
متن کاملUnsupervised Clustering Algorithm Based on Normalized Mahalanobis Distances
Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the d...
متن کاملMahalanobis-Taguchi System-based criteria selection for strategy formulation: a case in a training institution
The increasing complexity of decision making in a severely dynamic competitive environment of the universe has urged the wise managers to have relevant strategic plans for their firms. Strategy is not formulated from one criterion but from multiple criteria in environmental scanning, and often, considering all of them is not possible. A list of criteria utilizing Delphi was selected by consu...
متن کاملارائه یک الگوریتم خوشه بندی برای داده های دسته ای با ترکیب معیارها
Clustering is one of the main techniques in data mining. Clustering is a process that classifies data set into groups. In clustering, the data in a cluster are the closest to each other and the data in two different clusters have the most difference. Clustering algorithms are divided into two categories according to the type of data: Clustering algorithms for numerical data and clustering algor...
متن کامل